A Lobatto interpolation grid in the tetrahedron

نویسندگان

  • H. LUO
  • C. POZRIKIDIS
چکیده

A sequence of increasingly refined interpolation grids inside the tetrahedron is proposed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The number of interpolation nodes, N , corresponds to the number of terms in the complete mth-order polynomial expansion with respect to the three tetrahedral barycentric coordinates. The proposed grid is constructed by deploying Lobatto interpolation nodes over the faces of the tetrahedron, and then computing interior nodes using a simple formula that involves the zeros of the Lobatto polynomials. Numerical computations show that the Lebesgue constant and interpolation accuracy of the proposed grid compare favourably with those of alternative grids constructed by solving optimization problems. The condition number of the mass matrix is significantly lower than that of the uniform grid and comparable to that of optimal grids proposed by previous authors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparison of interpolation grids over the triangle or the tetrahedron

A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polyn...

متن کامل

Analysis of High-order Approximations by Spectral Interpolation Applied to One- and Two-dimensional Finite Element Method

The implementation of high-order (spectral) approximations associated with FEM is an approach to overcome the difficulties encountered in the numerical analysis of complex problems. This paper proposes the use of the spectral finite element method, originally developed for computational fluid dynamics problems, to achieve improved solutions for these types of problems. Here, the interpolation n...

متن کامل

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

Tensor product Gauss-Lobatto points are Fekete points for the cube

Tensor products of Gauss-Lobatto quadrature points are frequently used as collocation points in spectral element methods. Unfortunately, it is not known if Gauss-Lobatto points exist in non-tensor-product domains like the simplex. In this work, we show that the n-dimensional tensor-product of Gauss-Lobatto quadrature points are also Fekete points. This suggests a way to generalize spectral meth...

متن کامل

Particle tracing in curvilinear grids

Computational fluid dynamics simulations result in large multivariate data sets with information such as pressure, temperature and velocity available at grid points for a sequence of steps. Velocity data is typically visualized by displaying a particle animation or streamlines. We present an efficient method for calculating particle paths based on velocity data from curvilinear grids. In order ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006